Capacitated clustering problem in computational biology: Combinatorial and statistical approach for sibling reconstruction

نویسندگان
چکیده

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Capacitated clustering problem in computational biology: Combinatorial and statistical approach for sibling reconstruction

The capacitated clustering problem (CCP) has been studied in a wide range of applications. In this study, we investigate a challenging CCP in computational biology, namely, sibling reconstruction problem (SRP). The goal of SRP is to establish the sibling relationship (i.e., groups of siblings) of a population from genetic data. The SRP has gained more and more interests from computational biolo...

متن کامل

Combinatorial Reconstruction of Sibling Groups

Knowledge about sibling relationships is used in genetic epidemiology, conservation biology, and animal management. For example, knowledge of the genetic relationships among individuals is critical for estimating heritabilities of quantitative characters, for characterizing mating systems and fitness, and for managing populations of endangered species. When parental data are available, sibling ...

متن کامل

Combinatorial Reconstruction of Sibling Relationships

We present a new algorithm for reconstructing sibling relationships in a single generation of individuals without parental information, using data from codominant DNA markers such as microsatellites. We use the simple genetic constraints on the full-sibling groups, imposed by the Mendelian inheritance rules, and combinatorial optimization techniques to extract a minimum number of consistent sib...

متن کامل

A Hybrid Approach for Optimization of Capacitated Centered Clustering Problem

Capacitated Centered Clustering problem (CPMP) is an important variation of p-median problems. The p-median problems are known to be NP-hard. A hybrid genetic algorithm is used to solve the problem efficiently. The analysis shows that the performance of the proposed algorithm is better than the traditional local search heuristic.

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Computers & Operations Research

سال: 2012

ISSN: 0305-0548

DOI: 10.1016/j.cor.2011.04.017